Hill Cipher Modification based on Pseudo-Random Eigenvalues

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hill Cipher Modification based on Pseudo-Random Eigenvalues

The Hill cipher is resistant to brute-force and statistical attacks, but it can be broken with a known plaintext-ciphertext attack (KPCA). In this paper, we propose a modification of the Hill cipher, HCM-PRE, which is still resistant to brute-force and statistical attacks, and is resistant also to KPCA due to dynamic encryption key matrix generating. With the modification, the new HCM-PRE can b...

متن کامل

Investigation of Hill Cipher Modifications Based on Permutation and Iteration

Two recent Hill cipher modifications which iteratively use interweaving and interlacing are considered. We show that strength of these ciphers is due to non-linear transformation used in them (bit-level permutations). Impact of number of iterations on the avalanche effect is investigated. We propose two Hill cipher modifications using column swapping and arbitrary permutation with significantly...

متن کامل

Pseudo-random Bit Generator Based on Couple Chaotic Systems and Its Applications in Stream-Cipher Cryptography

Chaotic cryptology is widely investigated recently. This paper reviews the progress in this area and points out some existent problems in digital chaotic ciphers. As a comprehensive solution to these problems, a novel pseudo-random bit generator based on a couple of chaotic systems called CCS-PRBG is presented. Detailed theoretical analyses show that it has perfect cryptographic properties, and...

متن کامل

On the Keyspace of the Hill Cipher

ABSTRACT: In its most general form, the Hill cipher’s keyspace consists of all matrices of a given dimension that are invertible over Zm. Working from known results over finite fields, we assemble and prove a formula for the number of such matrices. We also compare this result with the total number of matrices and the number of involutory matrices for a given dimension and modulus, identifying ...

متن کامل

SVH: A Lightweight Stream Cipher Based on Dual Pseudo-Random Transformation and OFB

A new lightweight stream cipher, SVH, is proposed. The design targets hardware environments where gate count, power consumption and memory is very limited. It is based on dual pseudo-random transformation and output feedback. The block of key size is 64 bits and SVH can achieve sufficient security margin against known attacks, such as linear cryptanalysis, differential cryptanalysis, impossible...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics & Information Sciences

سال: 2014

ISSN: 1935-0090,2325-0399

DOI: 10.12785/amis/080208